Numerical Computation of the Capacity of Continuous Memoryless Channels
نویسنده
چکیده
We extend the Blahut-Arimoto algorithm to continuous memoryless channels by means of sequential Monte Carlo integration in conjunction with steepest descent. As an illustration, we consider the peak power constrained AWGN channel.
منابع مشابه
Gaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملOn Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless Channels
A computational scheme for calculating the capacity of continuous-input discrete-output memoryless channels is presented. By adopting relative entropy as a performance measure between two channel transition probabilities the method suggests an algorithm to discretize continuous channel inputs into a set of finite desired channel inputs so that the discrete version of the well-known ArimotoBlahu...
متن کاملComputation of the Capacity for Discrete Memoryless Channels and Sum Capacity of Multiple Access Channels with Causal Side Information at Receiver
Capacity analysis and computation for communication channels with side information at the receiver is an important area of research. Cover-Chiang have proved the increment of capacity with non-causal information at the receiver. We investigate this capacity increment for the channel with causal side information and proposed an efficient algorithm for computing the capacity of discrete memoryles...
متن کاملBinary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity
We derive a closed-form expression for the capacity of the additive-Gaussian-noise memoryless channel with binary input. The capacity expression that we obtain contains an infinite series. Truncation of the series -for computation reasonsat an odd or even number of terms results in a lower or upper, respectively, bound on the channel capacity; we prove that the tightness of the bound increases ...
متن کامل